/**
 * Created with IntelliJ IDEA.
 * Description:
 * User:38917
 * Date:2025/4/14
 * Time:12:39
 */
public class Solution {
    //
    public static int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left <= right) {
            int mid = (left + right) / 2;
            if(nums[mid] == target) {
                return mid;
            } else if(nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return left;
    }
    //
    public static void main(String[] args) {
        int[] nums = {1,3,5,6};
        int ret = searchInsert(nums,2);
        System.out.println(ret);
    }
}
